-
1 planar embedding
Большой англо-русский и русско-английский словарь > planar embedding
-
2 planar embedding
Математика: плоское вложение -
3 planar embedding
мат. -
4 embedding
1) вложение, вставка2) внедрение3) встраивание4) заделывание, заделка5) вдавливание; утапливание• -
5 плоское вложение
Большой англо-русский и русско-английский словарь > плоское вложение
-
6 point
1) точка2) балл, очко3) деление (шкалы); румб; лимб4) заострение, остриё, острый конец || заострять, затачивать5) полигр. пункт ( единица измерения в типографской системе мер)6) пост, пункт, место7) мыс8) наконечник9) предмет11) указывать•about a point — мат. в окрестности точки
point at infinity — мат. несобственный элемент, бесконечно удалённая точка
point covers a line — т. граф. вершина покрывает ребро
point in infinity — мат. точка в бесконечности
winding number of curve with respect to point — мат. порядок кривой относительно точки (число оборотов вектора, соединяющего данную точку с точкой кривой при обходе кривой)
right two points — мор. на два румба вправо
with a point as a center — мат. с центром в точке…
- bisecting point of a segment - conditionally stable point - division point - essentially singular point - general point - generic point - horizontal control point - infinitely remote point point - material point - minimal fixed point - negatively stable point - nonessential singular point - optimum point - piercing point of a line - point of greatest concentration - positively normal point - positively stable point - right singular point - single mass point - strongly recurrent point - strongly singular point - triply rational point - uniplanar double point - unstable nodal point - upper significance pointwith respect to point — мат. относительно точки
См. также в других словарях:
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Planar straight-line graph — (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. [cite book author = Franco P. Preparata and Michael Ian Shamos | title = Computational… … Wikipedia
Book embedding — In graph theory, book embedding is a generalization of planar embedding to nonplanar surfaces in the form of a book , a collection of pages (halfplanes) joined together at the spine of the book (the shared boundary of all the halfplanes). The… … Wikipedia
Digital planar holography — Planar waveguide Digital Planar Holography (DPH) is a new technology, developed recently, circa 2003, for fabricating miniature components for integrated optics. The essence of the DPH technology is embedding digital holograms, calculated in a… … Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… … Wikipedia
Planarity testing — In graph theory, the planarity testing problem asks whether, given a graph, that graph is a planar graph (can be drawn in the plane without edge intersections). This is a well studied problem in computer science for which many practical… … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Halin graph — In graph theory, a mathematical discipline, a Halin graph is a planar graph constructed from a plane embedding of a tree with at least 4 vertices and with no vertices of degree 2, by connecting all end vertices (i.e., the ones of degree 1) with a … Wikipedia
String graph — In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a string . Given a graph G , G is a string graph if and only if there exists a set of curves, or strings, drawn in the plane such that no three… … Wikipedia
Wheel graph — infobox graph name = Wheel graph image caption = Several examples of wheel graphs vertices = n edges = 2( n − 1) chromatic number = 3 if n is odd 4 if n is even chromatic index = In the mathematical discipline of graph theory, a wheel graph W n… … Wikipedia